例句與造句

1. Is there a name for the set of languages that are recognized by deterministic pushdown automata ( DPDAs )?
2. Deterministic context-free grammars are accepted by deterministic pushdown automata and can be parsed in linear time, for example by the LR parser.
3. In contrast to the construction for concatenation shown above, the complementation construction for visibly pushdown automata parallels the standard construction for deterministic pushdown automata.
4. It's difficult to find deterministic pushdown automata in a sentence. 用deterministic pushdown automata造句挺難的